'Weak Dependency Graph [60.0]'
------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1
, c(c(b(x1))) -> a(c(c(x1)))}
Details:
We have computed the following set of weak (innermost) dependency pairs:
{ a^#(x1) -> c_0(c^#(b(x1)))
, a^#(b(x1)) -> c_1()
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
The usable rules are:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
The estimated dependency graph contains the following edges:
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
==> {a^#(b(x1)) -> c_1()}
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
==> {a^#(x1) -> c_0(c^#(b(x1)))}
We consider the following path(s):
1) { c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a^#(b(x1)) -> c_1()}
The usable rules for this path are the following:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a^#(b(x1)) -> c_1()}
Details:
We apply the weight gap principle, strictly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
and weakly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(b(x1)) -> c_1()}
and weakly orienting the rules
{ c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(b(x1)) -> c_1()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {c(c(b(x1))) -> a(c(c(x1)))}
Weak Rules:
{ a^#(b(x1)) -> c_1()
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {c(c(b(x1))) -> a(c(c(x1)))}
Weak Rules:
{ a^#(b(x1)) -> c_1()
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ b_0(2) -> 2
, a^#_0(2) -> 1
, c^#_0(2) -> 1
, c_1_0() -> 1}
2) { c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a^#(x1) -> c_0(c^#(b(x1)))}
The usable rules for this path are the following:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a^#(x1) -> c_0(c^#(b(x1)))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
and weakly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules:
{ c(c(b(x1))) -> a(c(c(x1)))
, a^#(x1) -> c_0(c^#(b(x1)))}
Weak Rules:
{ c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules:
{ c(c(b(x1))) -> a(c(c(x1)))
, a^#(x1) -> c_0(c^#(b(x1)))}
Weak Rules:
{ c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem is Match-bounded by 1.
The enriched problem is compatible with the following automaton:
{ b_0(2) -> 2
, b_1(2) -> 8
, a^#_0(2) -> 4
, c_0_1(7) -> 4
, c^#_0(2) -> 6
, c^#_1(8) -> 7}
3) {c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
The usable rules for this path are the following:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ c(c(b(x1))) -> a(c(c(x1)))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1
, c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
and weakly orienting the rules
{ a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_1() = [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {c(c(b(x1))) -> a(c(c(x1)))}
Weak Rules:
{ c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {c(c(b(x1))) -> a(c(c(x1)))}
Weak Rules:
{ c^#(c(b(x1))) -> c_2(a^#(c(c(x1))))
, a(x1) -> b(c(b(x1)))
, a(b(x1)) -> x1}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ b_0(2) -> 2
, a^#_0(2) -> 4
, c^#_0(2) -> 6}